0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.12 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.11/0.32 % Computer : n006.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 1920 0.11/0.32 % WCLimit : 240 0.11/0.32 % DateTime : Wed Jul 30 05:50:19 EDT 2025 0.11/0.33 % CPUTime : 0.20/0.45 Running higher-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.iMVInA6pHw/E---3.1_3062.p 0.20/0.50 # Version: 3.0.0-ho 0.20/0.50 # Preprocessing class: HSMMSLSSLLLNHFA. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting new_ho_10_cnf2 with 1200s (5) cores 0.20/0.50 # Starting post_as_ho1 with 240s (1) cores 0.20/0.50 # Starting post_as_ho5 with 240s (1) cores 0.20/0.50 # Starting post_as_ho10 with 240s (1) cores 0.20/0.50 # post_as_ho5 with pid 3142 completed with status 0 0.20/0.50 # Result found by post_as_ho5 0.20/0.50 # Preprocessing class: HSMMSLSSLLLNHFA. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting new_ho_10_cnf2 with 1200s (5) cores 0.20/0.50 # Starting post_as_ho1 with 240s (1) cores 0.20/0.50 # Starting post_as_ho5 with 240s (1) cores 0.20/0.50 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 0.20/0.50 # Search class: HUUPF-FFSF22-SHFMMMNN 0.20/0.50 # partial match(4): HUUPF-FFSF22-SFFFFFNN 0.20/0.50 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.50 # Starting new_ho_10 with 130s (1) cores 0.20/0.50 # new_ho_10 with pid 3144 completed with status 10 0.20/0.50 # Starting post_as_ho5 with 25s (1) cores 0.20/0.50 # post_as_ho5 with pid 3145 completed with status 0 0.20/0.50 # Result found by post_as_ho5 0.20/0.50 # Preprocessing class: HSMMSLSSLLLNHFA. 0.20/0.50 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.20/0.50 # Starting new_ho_10_cnf2 with 1200s (5) cores 0.20/0.50 # Starting post_as_ho1 with 240s (1) cores 0.20/0.50 # Starting post_as_ho5 with 240s (1) cores 0.20/0.50 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 0.20/0.50 # Search class: HUUPF-FFSF22-SHFMMMNN 0.20/0.50 # partial match(4): HUUPF-FFSF22-SFFFFFNN 0.20/0.50 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.20/0.50 # Starting new_ho_10 with 130s (1) cores 0.20/0.50 # new_ho_10 with pid 3144 completed with status 10 0.20/0.50 # Starting post_as_ho5 with 25s (1) cores 0.20/0.50 # Preprocessing time : 0.001 s 0.20/0.50 # Presaturation interreduction done 0.20/0.50 0.20/0.50 # Proof found! 0.20/0.50 # SZS status Theorem 0.20/0.50 # SZS output start CNFRefutation 0.20/0.50 thf(decl_sort1, type, term: $tType). 0.20/0.50 thf(decl_sort2, type, subst: $tType). 0.20/0.50 thf(decl_23, type, one: term). 0.20/0.50 thf(decl_26, type, sub: term > subst > term). 0.20/0.50 thf(decl_28, type, sh: subst). 0.20/0.50 thf(decl_29, type, push: term > subst > subst). 0.20/0.50 thf(decl_71, type, hoasinduction_lem3b_lthm: $o). 0.20/0.50 thf(decl_120, type, hoasinduction_lem3b: $o). 0.20/0.50 thf(decl_145, type, esk1_0: term). 0.20/0.50 thf(hoasinduction_lem3b_lthm, axiom, ((hoasinduction_lem3b_lthm)<=>(hoasinduction_lem3b)), file('/export/starexec/sandbox2/tmp/tmp.iMVInA6pHw/E---3.1_3062.p', hoasinduction_lem3b_lthm)). 0.20/0.50 thf(hoasinduction_lem3b, axiom, ((hoasinduction_lem3b)<=>![X2:term]:(?[X12:subst > term > term]:(((sub @ X2 @ (push @ one @ sh))=(X12 @ sh @ one))))), file('/export/starexec/sandbox2/tmp/tmp.iMVInA6pHw/E---3.1_3062.p', hoasinduction_lem3b)). 0.20/0.50 thf(thm, conjecture, (hoasinduction_lem3b_lthm), file('/export/starexec/sandbox2/tmp/tmp.iMVInA6pHw/E---3.1_3062.p', thm)). 0.20/0.50 thf(c_0_3, axiom, ((hoasinduction_lem3b_lthm)=((![X30:term]:(?[X31:subst > term > term]:(((sub @ X30 @ (push @ one @ sh))=(X31 @ sh @ one))))))), inference(apply_def,[status(thm)],[hoasinduction_lem3b_lthm, hoasinduction_lem3b])). 0.20/0.50 thf(c_0_4, negated_conjecture, ~(![X32:term]:(?[X33:subst > term > term]:(((sub @ X32 @ (push @ one @ sh))=(X33 @ sh @ one))))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_3])). 0.20/0.50 thf(c_0_5, negated_conjecture, ![X35:subst > term > term]:(((sub @ esk1_0 @ (push @ one @ sh))!=(X35 @ sh @ one))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])). 0.20/0.50 thf(c_0_6, negated_conjecture, ![X12:subst > term > term]:(((sub @ esk1_0 @ (push @ one @ sh))!=(X12 @ sh @ one))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.20/0.50 thf(c_0_7, negated_conjecture, ($false), inference(er,[status(thm)],[c_0_6]), ['proof']). 0.20/0.50 # SZS output end CNFRefutation 0.20/0.50 # Parsed axioms : 238 0.20/0.50 # Removed by relevancy pruning/SinE : 235 0.20/0.50 # Initial clauses : 1 0.20/0.50 # Removed in clause preprocessing : 0 0.20/0.50 # Initial clauses in saturation : 1 0.20/0.50 # Processed clauses : 2 0.20/0.50 # ...of these trivial : 0 0.20/0.50 # ...subsumed : 0 0.20/0.50 # ...remaining for further processing : 2 0.20/0.50 # Other redundant clauses eliminated : 0 0.20/0.50 # Clauses deleted for lack of memory : 0 0.20/0.50 # Backward-subsumed : 0 0.20/0.50 # Backward-rewritten : 0 0.20/0.50 # Generated clauses : 1 0.20/0.50 # ...of the previous two non-redundant : 0 0.20/0.50 # ...aggressively subsumed : 0 0.20/0.50 # Contextual simplify-reflections : 0 0.20/0.50 # Paramodulations : 0 0.20/0.50 # Factorizations : 0 0.20/0.50 # NegExts : 0 0.20/0.50 # Equation resolutions : 1 0.20/0.50 # Disequality decompositions : 0 0.20/0.50 # Total rewrite steps : 0 0.20/0.50 # ...of those cached : 0 0.20/0.50 # Propositional unsat checks : 0 0.20/0.50 # Propositional check models : 0 0.20/0.50 # Propositional check unsatisfiable : 0 0.20/0.50 # Propositional clauses : 0 0.20/0.50 # Propositional clauses after purity: 0 0.20/0.50 # Propositional unsat core size : 0 0.20/0.50 # Propositional preprocessing time : 0.000 0.20/0.50 # Propositional encoding time : 0.000 0.20/0.50 # Propositional solver time : 0.000 0.20/0.50 # Success case prop preproc time : 0.000 0.20/0.50 # Success case prop encoding time : 0.000 0.20/0.50 # Success case prop solver time : 0.000 0.20/0.50 # Current number of processed clauses : 1 0.20/0.50 # Positive orientable unit clauses : 0 0.20/0.50 # Positive unorientable unit clauses: 0 0.20/0.50 # Negative unit clauses : 1 0.20/0.50 # Non-unit-clauses : 0 0.20/0.50 # Current number of unprocessed clauses: 0 0.20/0.50 # ...number of literals in the above : 0 0.20/0.50 # Current number of archived formulas : 0 0.20/0.50 # Current number of archived clauses : 1 0.20/0.50 # Clause-clause subsumption calls (NU) : 0 0.20/0.50 # Rec. Clause-clause subsumption calls : 0 0.20/0.50 # Non-unit clause-clause subsumptions : 0 0.20/0.50 # Unit Clause-clause subsumption calls : 0 0.20/0.50 # Rewrite failures with RHS unbound : 0 0.20/0.50 # BW rewrite match attempts : 0 0.20/0.50 # BW rewrite match successes : 0 0.20/0.50 # Condensation attempts : 0 0.20/0.50 # Condensation successes : 0 0.20/0.50 # Termbank termtop insertions : 4918 0.20/0.50 # Search garbage collected termcells : 1845 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.006 s 0.20/0.50 # System time : 0.002 s 0.20/0.50 # Total time : 0.008 s 0.20/0.50 # Maximum resident set size: 2416 pages 0.20/0.50 0.20/0.50 # ------------------------------------------------- 0.20/0.50 # User time : 0.015 s 0.20/0.50 # System time : 0.003 s 0.20/0.50 # Total time : 0.018 s 0.20/0.50 # Maximum resident set size: 2080 pages 0.20/0.50 % E exiting 0.20/0.50 % E exiting 0.20/0.50 EOF